The tree-structured distributed network front-end processor architecture

نویسندگان

  • ROBERT M. MONROE
  • RONALD J. SRODAWA
  • FRANKLIN H. WESTERVELT
چکیده

Contemporary front-end processors, such as the IBM 3705,1 Memorex 1380, Burroughs Data Communications Processor3 and the MERIT Communications Controller, 4 share the same general architecture depicted in Figure 1. Communication !ines are associated on a one-on-one basis with line adapters. These are connected in small groups (clusters) to the local processor, and perhaps to the local memory, through line interface bases. In a similar manner, the host system input/output channels are associated on a one-onone basis with channel adapters which are connected to the local processor and memory. The architecture can be thought of as a minicomputer system in which the channel adapters and line interface base/line adapter subsystems are input/output devices. In fact, many front-end processors are configured in precisely this fashion. There are many design parameters which can be varied to affect the maximum aggregate data rate, cost, and servicesrendered characteristics of front-end processors. The number of line adapters per line interface base and their relative complexities are an example. The line interface bases might interrupt the processor for every character or transfer entire records by means of direct memory accesses. The channel adapters might connect directly to the host system channels or through some other standard interface such as a channelto-channel adapter or high-speed communication line. Generally channel adapters utilize direct memory access features because of the high aggregate data rates they sustain. All of the intelligence of a typical front-end processor is iocated in the single local uni-processor. This uni-processor must handle all the interrupts from the line and channel adapters. In effect it is multiprogrammed across all of the data streams to provide front-end services such as line editing, character code translation, and message formatting. Saturation of the local processor limits the kinds of services that can be provided and the aggregate data rate that can be sustained. We describe here a front-end processor architecture in which the single local uni-processor, memory, line interface bases and line adapters are replaced with a network of microprocessor systems as depicted in Figure 2. The network

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays

The problem of obtaining optimal processing time in a distributed computing system consisting of ( N + 1) processors and :V communication links, arranged in a single-level tree architecture, is considered. It is shown that optimality can be achieved through a hierarchy of steps involving optimal load distribution, load sequencing, and processor-link arrangement. Closed-form expressions for opti...

متن کامل

A Modular Boolean Architecture for Pattern Recognition

This paper describes a modular neuml structure where a self-organising Boolean neuml network architecture (SOFT) is used as a front-end processor to a feedforward neuml architecture based on goal-seeking principles (GSNf ). The characteristics of this architecture are illustrated by considering its application to a chamcter recognition problem.

متن کامل

Implementation of Low-Cost Architecture for Control an Active Front End Rectifier

In AC-DC power conversion, active front end rectifiers offer several advantages over diode rectifiers such as bidirectional power flow capability, sinusoidal input currents and controllable power factor. A digital finite control set model predictive controller based on fixed-point computations of an active front end rectifier with unity displacement of input voltage and current to improve dynam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010